class Node:
    def __init__(self,data,next):
        self.data = data
        self.next=None


class List():
    def __init__(self,node=None):
        self.head=node

    def length(self):
        cur=self.head
        count=0
        while cur!=None:
            count+=1
            cur=cur.next
        return count

    def add_tail(self,val):
        node=Node(val)
        if self.is_empty():
            self.head=node
        else:
            cur=self.head
            while cur.next!=None:
                cur=cur.next
            cur.next=node

    def find(self,pos):
        if pos < 0 or pos > self.length()-1:
            return "错误"
        cur=self.head
        count=0
        while cur!=None:
            if count==pos:
                return count  
            else:
                count+=1
                cur=cur.next  

    def sol(self):
        cur=self.head
        list=[]
        while cur!=None:
            list.append(cur.elem)
            cur=cur.next
        N=n.find(2)
        print(list[N:])
        

if __name__=="__main__":
    n=List()
    n.add_tail(1)
    n.add_tail(2)
    n.add_tail(3)
    n.add_tail(4)
    n.add_tail(5)
    n.sol()